Scheduling Intervals Using Independent Sets in Claw-Free Graphs
نویسندگان
چکیده
Interactive Stereoscopic Visualization of Very Large Visible Men on CAVE p. 41 Panoramic Spherical Video The Space Ball p. 51 Human Expressions Interaction Between Avatar and Virtual World p. 59 Progressive Curve Representation Based on Reverse Subdivision p. 67 Concept-Based Image Retrieval Using the New Semantic Similarity Measurement p. 79 Caseand Rule-Based Algorithms for the Contextual Pattern Recognition Problem p. 89 A Simple Algorithm for Object Location from a Single Image without Camera Calibration p. 99
منابع مشابه
Bounds on the Number of Vertex Independent Sets in a Graph
We consider the number of vertex independent sets i(G). In general, the problem of determining the value of i(G) is NP -complete. We present several upper and lower bounds for i(G) in terms of order, size or independence number. We obtain improved bounds for i(G) on restricted graph classes such as the bipartite graphs, unicyclic graphs, regular graphs and claw-free graphs.
متن کاملApproximating independence polynomials of claw-free graphs
Matchings in graphs correspond to independent sets in the corresponding line graphs. Line graphs are an important subclass of claw-free graphs. Hence studying independence polynomials of claw-free graphs is a natural extension of studying matching polynomials of graphs. We extend a result of Bayati et.al. showing a fully polynomial time approximation scheme (FPTAS) for computing the independenc...
متن کاملCounting Independent Sets in Claw-Free Graphs
Although many of the counting problems (e.g. counting independent sets or matchings in a graph) are known to be #P-Complete (see Vadhan [3]), a remarkable progress has been done in designing exponential time algorithms solving them. Dahllöf, Jonsson, Wahlström [2] constructed algorithms that count maximum weight models of 2-SAT formulas in time O∗(1.2561n). This bound bound was later improved t...
متن کاملNearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time
In this paper, we address the scheduling problem in wireless ad hoc networks by exploiting the computational advantage that comes when such scheduling problems can be represented by clawfree conflict graphs where we consider a wireless broadcast medium. It is possible to formulate a scheduling problem of network coded flows as finding maximum weighted independent set (MWIS) in the conflict grap...
متن کامل2-factors and Independent Sets on Claw-free Graphs
In this paper, we show that if G is an l-connected claw-free graph with minimum degree at least three and l ∈ {2, 3}, then for any maximum independent set S, there exists a 2-factor in which each cycle contains at least l − 1 vertices in S.
متن کامل